A cyclic queueing network with dependent exponential service times
نویسندگان
چکیده
منابع مشابه
Cyclic Queueing Networks with Subexponential Service Times
For a K-stage cyclic queueing network with N customers and general service times we provide bounds on the n departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service time distribution is subexponential.
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملA queueing model with dependence between service and interarrival times
We consider a storage model that can be either interpreted as a certain queueing model with dependence between a service request and the subsequent interarrival time, or as a fluid production/inventory model with a two-state random environment. We establish a direct link between the workload distributions· of the queueing model and the production/inventory model, and we present a detailed analy...
متن کاملa random walk with exponential travel times
consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملConcavity of Queueing Systems with Nbu Service Times
This paper establishes structural properties of the throughput of a large class of queueing networks with i.i.d. new-better-than-used service times. The main result obtained in this paper is applied to a wide range of networks including tandems, cycles and fork-join networks with general blocking and starvation as well as certain networks with splitting-merging of traac streams, to deduce conca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 1978
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200045940